Extended Node-Arc Formulation for the K-Edge-Disjoint Hop-Constrained Network Design Problem
نویسندگان
چکیده
This paper considers the K-edge-disjoint hop-constrained Network Design Problem (HCNDP) which consists in finding a minimum cost subgraph such that there exists at least K-edge-disjoint paths between origins and destinations of demands, and such that the length of these paths is at most equal to a given parameter L. This problem was considered in the past using only design variables. Here, we consider an extended node-arc formulation, introducing flow variables to model the paths. We conjecture that our formulation leads to the complete description of the associated polyhedron and we provide an algorithm leading to good performances in terms of computing times.
منابع مشابه
On the hop-constrained survivable network design problem with reliable edges
In this paper, we study the hop-constrained survivable network design problemwith reliable edges. Given a graph with non-negative edge costs and node pairs Q, the hop-constrained survivable network design problem consists of constructing a minimum cost set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. In addition...
متن کاملHop-Constrained Node Survivable Network Design: an Application to MPLS over WDM
This paper addresses hop-constrained node survivable networks, i.e., networks protecting the demands through node disjoint paths and, simultaneously, guaranteeing a maximum number of hops for all demand paths in any failure situation. This problem is studied in the context of a MPLS over WDM network design problem. Given the WDM network topology and the traffic demand matrix, which includes the...
متن کاملBenders Decomposition for the Hop-Constrained Survivable Network Design Problem
Given a graph with nonnegative edge weights and node pairs Q, we study the problem of constructing a minimum weight set of edges so that the induced subgraph contains at least K edge-disjoint paths containing at most L edges between each pair in Q. Using the layered representation introduced by Gouveia (1998), we present a formulation for the problem valid for any K, L ! 1. We use a Benders dec...
متن کاملInteger programming formulations for the k-edge-connected 3-hop-constrained network design problem
In this paper, we study the k edge-connected L-hop-constrained network design problem. Given a weighted graph G = (V,E), a set D of pairs of nodes, two integers L ≥ 2 and k ≥ 2, the problem consists in finding a minimum weight subgraph of G containing at least k edge-disjoint paths of length at most L between every pairs {s, t} ∈ D. We consider the problem in the case where L = 2, 3 and |D| ≥ 2...
متن کاملTraffic Engineering over Hop-Constrained Node Survivable Networks
Traffic engineering on a given network is the task of determining how traffic commodities must be routed in order to maintain an optimal performance. In this work, we aim to optimize routing by minimizing the number of routing hops, which has a positive impact on the delay provided by the network to traffic commodities, while ensuring some desired survivability guarantees. In [1], we have consi...
متن کامل